Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
نویسندگان
چکیده
منابع مشابه
Approximate inverse preconditioning in the parallel solution of sparse eigenproblems
A preconditioned scheme for solving sparse symmetric eigenproblems is proposed. The solution strategy relies upon the DACG algorithm, which is a Preconditioned Conjugate Gradient algorithm for minimizing the Rayleigh Quotient. A comparison with the well established ARPACK code, shows that when a small number of the leftmost eigenpairs is to be computed, DACG is more efficient than ARPACK. Effec...
متن کاملFactorized approximate inverse preconditioning of a parallel sparse eigensolver
We exploit an optimization method, called DACG, which sequentially computes the smallest eigenpairs of a symmetric, positive deenite, generalized eigenproblem, by CG minimizations of the Rayleigh quotient over subspaces of decreasing size. In this paper we analyze the eeectiveness of the approximate inverse preconditioners, AINV and FSAI as DACG preconditioners for the solution of Finite Elemen...
متن کاملParallel solution of large-scale free surface viscoelastic flows via sparse approximate inverse preconditioning
Though computational techniques for two-dimensional viscoelastic free surface flows are well developed, three-dimensional flows continue to present significant computational challenges. Fully coupled free surface flow models lead to nonlinear systems whose steady states can be found via Newton’s method. Each Newton iteration requires the solution of a large, sparse linear system, for which memo...
متن کاملParallel Preconditioning with Sparse Approximate Inverses
A parallel preconditioner is presented for the solution of general sparse linear systems of equations. A sparse approximate inverse is computed explicitly and then applied as a preconditioner to an iterative method. The computation of the preconditioner is inherently parallel, and its application only requires a matrix-vector product. The sparsity pattern of the approximate inverse is not impos...
متن کاملScalable Parallel Preconditioning with the Sparse Approximate Inverse of Triangular Matrices
In this paper an approach is proposed for preconditioning large general sparse matrices. This approach combines the scalability of explicit preconditioners with the preconditioning eeciency of incomplete factorizations. Several algorithms resulting from this approach are presented. Both the preconditioning eeciency and the cost of applying this preconditioner are tested. The experiments indicat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Linear Algebra with Applications
سال: 2000
ISSN: 1070-5325,1099-1506
DOI: 10.1002/(sici)1099-1506(200004/05)7:3<99::aid-nla188>3.0.co;2-5